Fuzzy clustering-based microaggregation to achieve probabilistic k-anonymity for data with constraints
نویسندگان
چکیده
منابع مشابه
Data Utility in Differential Privacy via Microaggregation-based k-Anonymity”
In addition to the general-purpose SSE-based utility evaluation conducted and discussed in the body of the article, in this appendix we provide evaluation results for a specific data use, namely counting queries. The reason of focusing on this data use is that many related works on differentially-private data publishing aim at preserving the utility for counting queries over protected data [12–...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولModel-based Clustering With Probabilistic Constraints
The problem of clustering with constraints is receiving increasing attention. Many existing algorithms assume the specified constraints are correct and consistent. We take a new approach and model the uncertainty of constraints in a principled manner by treating the constraints as random variables. The effect of specified constraints on a subset of points is propagated to other data points by b...
متن کاملA k -Anonymity Clustering Method for Effective Data Privacy Preservation
Data privacy preservation has drawn considerable interests in data mining research recently. The k-anonymity model is a simple and practical approach for data privacy preservation. This paper proposes a novel clustering method for conducting the k-anonymity model effectively. In the proposed clustering method, feature weights are automatically adjusted so that the information distortion can be ...
متن کاملFuzzy and Probabilistic Clustering with Shape and Size Constraints
More sophisticated fuzzy clustering algorithms, like the Gustafson–Kessel algorithm [11] and the fuzzy maximum likelihood estimation (FMLE) algorithm [10] offer the possibility of inducing clusters of ellipsoidal shape and different sizes. The same holds for the expectation maximization (EM) algorithm for a mixture of Gaussians. However, these additional degrees of freedom can reduce the robust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent & Fuzzy Systems
سال: 2020
ISSN: 1064-1246,1875-8967
DOI: 10.3233/jifs-189074